منابع مشابه
Note on Scheduling Intervals on-line
An optimal on-line algorithm is presented for the following optimization problem, which constitutes the special case of the k-track assignment problem with identical time windows. Intervals arrive at times ti and demand service time equal to their length. An interval is considered lost if it is not assigned to one of k identical service stations immediately or if its service is interrupted. Min...
متن کاملA Note on Coloring Line Arrangements
We show that the lines of every arrangement of n lines in the plane can be colored with O( √ n/ log n) colors such that no face of the arrangement is monochromatic. This improves a bound of Bose et al. by a Θ( √ log n) factor. Any further improvement on this bound would also improve the best known lower bound on the following problem of Erdős: estimate the maximum number of points in general po...
متن کاملA note on singular line graphs
It is shown that if G is a graph with an odd number of spanning trees, then the line graph L(G) of G has nullity at most one.
متن کاملProduct Line Rivalry: Note
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your perso...
متن کاملA note on on-line broadcast scheduling with deadlines
Article history: Received 19 March 2008 Received in revised form 4 July 2008 Communicated by C. Scheideler
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Mathematical Gazette
سال: 1905
ISSN: 0025-5572
DOI: 10.2307/3603878